A memetic algorithm for high‐strength covering array generation

Covering array generation (CAG) is the key research problem in combinatorial testing and an NP-complete problem. With increasing complexity of software under test need for higher interaction covering strength t, techniques constructing high-strength arrays are expected. This paper presents a hybrid heuristic memetic algorithm named QSSMA CAG The sub-optimal solution acceptance rate introduced to generate multiple cases after each iteration improve efficiency high-covering suites. method could successfully build suites some instances where t up 15 within one day cutoff time report five new best suite size records. Extensive experiments demonstrate that competitive compared state-of-the-art methods.